Relay Assumption Based Operational Complexity and Computational Time Reduction of Two Time Slots Tdma-based Protocol

The two time slots TDMA-based algorithms has been proposed by various researchers. However, the high operational complexity and computational time reduces the performance of these algorithms and has several limitations. Therefore, the Relay Assumption-based Operational Complexity Reduction Algorithm (RAOCRA) has been proposed. It is assumed that the relay is stationary and completely normalizes the incoming signal from the source. The average probability of bit error rate has been derived at destination, using the products of MGFs of the source to destination and relay to destination links. The performance analysis and evaluation has been carried out, with the comparison of previous proposed algorithm. The proposed algorithm demonstrated better performance, in terms of low BER and high BER-Gain values, with the increase in SNR values. Moreover, the RAOCRA showed improvement, in terms of low operational complexity and computation time with the increase in SNR values, in contrast to previous proposed algorithm. Furthermore, the Global-Percentage-Error-Decrease (GPED) and Local-Percentage-Error (LPED) methods have been used, to evaluate the accuracy of the proposed algorithm.